Computation tree

Results: 129



#Item
21Efficient Densest Subgraph Computation in Evolving Graphs Alessandro Epasto∗ Silvio Lattanzi

Efficient Densest Subgraph Computation in Evolving Graphs Alessandro Epasto∗ Silvio Lattanzi

Add to Reading List

Source URL: www.epasto.org

Language: English - Date: 2015-07-21 16:42:36
22Optimal Direct Sum Results for Deterministic and Randomized Decision Tree Complexity ∗ Rahul Jain† Hartmut Klauck‡ Miklos Santha§ Abstract A Direct Sum Theorem holds in a model of computation, when for every probl

Optimal Direct Sum Results for Deterministic and Randomized Decision Tree Complexity ∗ Rahul Jain† Hartmut Klauck‡ Miklos Santha§ Abstract A Direct Sum Theorem holds in a model of computation, when for every probl

Add to Reading List

Source URL: www.liafa.univ-paris-diderot.fr

Language: English - Date: 2010-12-13 11:02:51
    23Automatic construction of parse trees for lexemes ∗ Danny Dub´e Anass Kadiri  Universit´e Laval

    Automatic construction of parse trees for lexemes ∗ Danny Dub´e Anass Kadiri Universit´e Laval

    Add to Reading List

    Source URL: schemeworkshop.org

    Language: English - Date: 2011-08-12 16:48:41
    24Poster: Differentially Private Decision Tree Learning from Distributed Data Parisa Kaghazgaran Hassan Takabi

    Poster: Differentially Private Decision Tree Learning from Distributed Data Parisa Kaghazgaran Hassan Takabi

    Add to Reading List

    Source URL: www.ieee-security.org

    Language: English - Date: 2015-05-11 16:42:26
    25A Temporal Logic for Hyperproperties Bernd Finkbeiner1 , Markus N. Rabe1 , and César Sánchez2,

    A Temporal Logic for Hyperproperties Bernd Finkbeiner1 , Markus N. Rabe1 , and César Sánchez2,

    Add to Reading List

    Source URL: software.imdea.org

    Language: English - Date: 2014-06-27 10:56:07
    26CALCULATING THE NML DISTRIBUTION FOR TREE-STRUCTURED BAYESIAN NETWORKS Hannes Wettig, Petri Kontkanen and Petri Myllym¨aki Complex Systems Computation Group (CoSCo), Helsinki Institute for Information Technology (HIIT)

    CALCULATING THE NML DISTRIBUTION FOR TREE-STRUCTURED BAYESIAN NETWORKS Hannes Wettig, Petri Kontkanen and Petri Myllym¨aki Complex Systems Computation Group (CoSCo), Helsinki Institute for Information Technology (HIIT)

    Add to Reading List

    Source URL: sp.cs.tut.fi

    Language: English - Date: 2008-08-06 09:48:00
      27Efficient Term Size Computation for Granularity Control 1 M. Hermenegildo and P. L´ opez-Garc´ıa

      Efficient Term Size Computation for Granularity Control 1 M. Hermenegildo and P. L´ opez-Garc´ıa

      Add to Reading List

      Source URL: clip.dia.fi.upm.es

      Language: English - Date: 2003-01-10 07:03:18
      28Seminar on Sublinear Time Algorithms  Lecture 5 April 21, 2010 Lecturer: Robert Krauthgamer

      Seminar on Sublinear Time Algorithms Lecture 5 April 21, 2010 Lecturer: Robert Krauthgamer

      Add to Reading List

      Source URL: www.wisdom.weizmann.ac.il

      Language: English - Date: 2010-05-17 00:53:00
      29Zones From infinte to finite

      Zones From infinte to finite

      Add to Reading List

      Source URL: www2.imm.dtu.dk

      Language: English - Date: 2006-08-08 11:16:24
      30Online Computation with Advice Yuval Emek1 ? , Pierre Fraigniaud2 ??  , Amos Korman2

      Online Computation with Advice Yuval Emek1 ? , Pierre Fraigniaud2 ?? , Amos Korman2

      Add to Reading List

      Source URL: www.liafa.jussieu.fr

      Language: English - Date: 2010-02-08 08:39:17